Pruned Convolutional Codes and Viterbi Decoding Using the Levenshtein Distance Metric Applied to Asynchronous Noisy Channels
نویسندگان
چکیده
For a convolutional encoding and Viterbi decoding system, two insertion/deletion/substitution (IDS) error correcting techniques are presented in this paper. In the first means, by using the pruned convolutional codes, a rate compatible encoding system can adapt the transmission according to the state of the channel having IDS errors. In the second means, a convolutional encoded sequence is decoded by a modified Viterbi decoding algorithm using the Levenshtein distance metric, in which the IDS errors can be corrected at the same time.
منابع مشابه
Soft-Decision Decoding of Punctured Convolutional Codes in Asynchronous-CDMA Communications Under Perfect Phase-Tracking Conditions
In this paper, the performance of punctured convolutional codes of short constraint lengths is discussed. The punctured codes are used to provide error protection to a particular user in an asynchronous CDMA system. A perfect phase reference is assumed to be available throughout this paper. A slow fading Rician channel is assumed. Maximum likelihood decoding through a Viterbi algorithm is used ...
متن کاملFPGA Implementation of Viterbi Algorithm for Decoding of Convolution Codes
Abstract: Convolutional code is a coding scheme used in communication systems including deep space communications and wireless communications. It provides an alternative approach to block codes for transmission over a noisy channel. The block codes can be applied only for the block of data. The Convolutional coding has an advantage over the block codes in that it can be applied to a continuous ...
متن کاملA Study of Viterbi Decoder Algorithm for Wireless LANs
Viterbi Decoders are commonly used to decode convolutional codes in communications systems. This Viterbi Decoder is a fully parallel implementation which gives fast data throughput. The decoder is targeted for WiMAX and Wireless LAN applications. Input symbol metric pairs are decoded into output data bits by the maximum likelihood Viterbi processor core. Decoder supports both hard and soft inpu...
متن کاملSimulation Study of the Performance of the Viterbi Decoding Algorithm for Certainm-level Line Codes
In this paper we study the performance of different classes of M-level line codes under the Viterbi decoding algorithm. Some of the presented M-level line codes inherited the state machine structure by using the technique of distance mappings which preserve the properties of binary convolutional codes. Other M-level line codes were enforced to have the state machine structure to make use of the...
متن کاملList Decoding of Insertions and Deletions
List decoding of insertions and deletions in the Levenshtein metric is considered. The Levenshtein distance between two sequences is the minimum number of insertions and deletions needed to turn one of the sequences into the other. In this paper, a Johnson-like upper bound on the maximum list size when list decoding in the Levenshtein metric is derived. This bound depends only on the length and...
متن کامل